Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
نویسندگان
چکیده
منابع مشابه
46 : 2 Incremental Exact Min - Cut in Poly - logarithmic Amortized
We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with Õ(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtaine...
متن کاملMaintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
A sparse subgraph G′ of G is called a matching sparsifier if the size or weight of matching in G′ is approximately equal to the size or weight of maximum matching in G. Recently, algorithms have been developed to find matching sparsifiers in a static bipartite graph. In this paper, we show that we can find matching sparsifier even in an incremental bipartite graph. This observation leads to fol...
متن کاملSolving online feasibility problem in constant amortized time per update
We present a deterministic algorithm for solving the two and three-dimensional online feasibility problem. Insertion of a new constraint is processed in constant amortized time. Our method is adapted from the offline linear deterministic Megiddo algorithm for linear programming. As in his prune and search technique, our method and its time bound extend to higher dimensions but involve the same ...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملPolylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3174803